Leader Election Algorithm in Hypercubes with the Presence
نویسندگان
چکیده
Leader Election is a fundamental problem in centralized control of distributed systems. The election process starts when one or more processors discover that the leader has failed, and it terminates when the remaining processors know who the new leader is. This study presents a distributed solution to this problem in Hypercube networks considering the link failure. A distributed leader election algorithm is proposed and its performance is evaluated. Contention and synchronization issues are also considered. In a network of N processors connected by a Hypercube network the proposed algorithm uses O(N ) messages to elect a new leader in O(log N) time steps. Index Terms Hypercube Network, Leader Election, , Leader Failure, Link failure, message complexity, time complexity.
منابع مشابه
Leader election in oriented star graphs
Leader election in a network plays an important role in the area of distributed algorithm design. Structural properties of the network as well as presence of direction on the edges of the network greatly affects the complexity of the leader election problem which is primarily measure by the message complexity of the protocol. Our purpose in the present paper is to adapt the existing distributed...
متن کاملLinear Broadcasting and N loglog N Election in Unoriented Hypercubes
In this paper, we provide eecient broadcasting and election algorithms in unoriented hypercubes. First, O(N) broadcasting and traversing algorithms are introduced, where N is the number of hy-percube vertices. This answers aarmatively the open question stated in Tel95a] whether linear-message broadcasting and traversing can be achieved on hypercubes without sense of direction. Moreover, by expl...
متن کاملSublinear Bounds for Randomized Leader Election
This paper concerns randomized leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete n-node networks that runs in O(1) rounds and (with high probability) uses only O( √ n log n) messages to elect a unique leader (with high probability). When considering the “explicit” variant of leader election where eventually every node knows th...
متن کاملOptimal Elections in Labeled Hypercubes
We study the message complexity of the Election Problem in Hypercube networks , when the processors have a \Sense of Direction", i.e., the capability to distinguish between adjacent communication links according to some globally consistent scheme. We present two models of Sense of Direction, which diier regarding the way the labeling of the links in the network is done: either by matching based...
متن کاملAn Election Algorithm to Ensure the High Availability of Leader in Large Mobile Ad Hoc Networks∗
A fundamental problem of distributed systems, leader election, is presented in the context of mobile ad hoc networks (MANETs). In many distributed systems, the presence of a leader is necessary in order to monitor underlying computations, guarantee quality functioning, take checkpoints, generate the lost token, detect quiescence conditions, etc. Hence, several leader election algorithms have be...
متن کامل